Decidability of bisimulation equivalence for normed pushdown processes
نویسندگان
چکیده
منابع مشابه
Decidability of Bisimulation Equivalence for Pushdown Processes
We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.
متن کاملFaster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n) time. We give an alternative algorithm working in O(npolylog n) time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from O(npolylog n) to O(npolylog n).
متن کاملDecidability of Bisimulation Equivalence of Context-free Processes Extends to Processes Deened over Bpa
In CHS92] was proved that (strong) bisimulation equivalence is de-cidable for all context-free processes. We reduce eeectively the question of bisimulation equivalence of processes in BPA to that of context-free processes, by interpreting the deadlocking process as a process which iterates a fresh action forever. This shows that bisimulation is also decidable for BPA. 1 Introduction In BBK87, B...
متن کاملA Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes
A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commutative parallel-composition operator. 1 Discussion Consider a collection (actually a multiset) of \elementary processes," each of a nite number of diierent kinds. At any instant, one of the elementary processes may spontaneous...
متن کاملDecidability of Bisimulation Equivalence for First-Order Grammars
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00216-8